A multiple sum involving the Mobius function

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multiple Sum Involving the Möbius Function

We consider a multiple arithmetical sum involving the Möbius function which despite its elementary appearance is in fact of a highly intriguing nature. We establish an asymptotic formula for the quadruple case that raises the first genuinely non-trivial situation. This is a rework of an old unpublished note of ours. 2001 Mathematics Subject Classification: Primary 11A25; Secondary 11M06

متن کامل

A Remark on Partial Sums Involving the Mobius Function

Let 〈P〉 ⊂ N be a multiplicative subsemigroup of the natural numbers N= {1, 2, 3, . . .} generated by an arbitrary set P of primes (finite or infinite). We give an elementary proof that the partial sums ∑ n∈〈P〉:n≤x (μ(n))/n are bounded in magnitude by 1. With the aid of the prime number theorem, we also show that these sums converge to ∏ p∈P (1− (1/p)) (the case where P is all the primes is a we...

متن کامل

Congruences involving alternating multiple harmonic sum

We show that for any prime prime p = 2 p−1 k=1 (−1) k k − 1 2 k ≡ − (p−1)/2 k=1 1 k (mod p 3) by expressing the l.h.s. as a combination of alternating multiple harmonic sums.

متن کامل

ON A SUM INVOLVING THE PRIME COUNTING FUNCTION π(x)

An asymptotic formula for the sum of reciprocals of π(n) is derived, where π(x) is the number of primes not exceeding x. This result improves the previous results of De Koninck-Ivi´c and L. Panaitopol. Let, as usual, π(x) = px 1 denote the number of primes not exceeding x. The prime number theorem (see e.g., [2, Chapter 12]) in its strongest known form states that (1) π(x) = li x + R(x), with (...

متن کامل

The Mobius Function of a Restricted Composition Poset

We study a poset of compositions restricted by part size under a partial ordering introduced by Björner and Stanley. We show that our composition poset Cd+1 is isomorphic to the poset of words A ∗ d. This allows us to use techniques developed by Björner to study the Möbius function of Cd+1. We use counting arguments and shellability as avenues for proving that the Möbius function is μ(u,w) = (−...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publications de l'Institut Mathematique

سال: 2004

ISSN: 0350-1302

DOI: 10.2298/pim0476031m